منابع مشابه
Antimagic Orientation of Biregular Bipartite Graphs
An antimagic labeling of a directed graph D with n vertices and m arcs is a bijection from the set of arcs of D to the integers {1, . . . ,m} such that all n oriented vertex sums are pairwise distinct, where an oriented vertex sum is the sum of labels of all arcs entering that vertex minus the sum of labels of all arcs leaving it. An undirected graph G is said to have an antimagic orientation i...
متن کاملMatchings in Random Biregular Bipartite Graphs
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdős and Rényi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.
متن کاملA Note on Path Factors of (3,4)-Biregular Bipartite Graphs
A proper edge coloring of a graph G with colors 1, 2, 3, . . . is called an interval coloring if the colors on the edges incident with any vertex are consecutive. A bipartite graph is (3, 4)-biregular if all vertices in one part have degree 3 and all vertices in the other part have degree 4. Recently it was proved [J. Graph Theory 61 (2009), 88-97] that if such a graph G has a spanning subgraph...
متن کاملOn short cycle enumeration in biregular bipartite graphs
ABSTRACT. A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs are bipartite and many of these constructions yield biregular graphs where the degree of left vertices is a constant c+1 and that of the right ver...
متن کاملBulk Eigenvalue Correlation Statistics of Random Biregular Bipartite Graphs
In this paper, we consider the randommatrix ensemble given by (db, dw)-regular graphs onM black vertices andN white vertices, where db ∈ [N γ , N2/3−γ ] for any γ > 0. We simultaneously prove that the bulk eigenvalue correlation statistics for both normalized adjacency matrices and their corresponding covariance matrices are stable for short times. Combined with an ergodicity analysis of the Dy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1994
ISSN: 0195-6698
DOI: 10.1006/eujc.1994.1024